Efficient Multiuser Itinerary Planning for Travelling Services Using Fkm-clustering Algorithm

This paper proposes, previous efforts address the problem by providing an automatic itinerary planning service that organizes the points-ofinterests (POIs) into a customized itinerary. The search space of all possible itineraries is too costly to fully visit, to simplify the complexity, most work assume that user’s trip is limited to some important POIs and will complete within one day. To address the above Problem, design a more general automatic itinerary planning service, this generates multiday itineraries for the users. All POIs are considered and ranked based on the user’s preference. Since the many users are planning for a trip with various requirements then their search complexity is increased. To overcome this limitation using the concept of grouping or clustering the users based on user’s requirement similarity. The novel modified clustering is using for grouping the user according to their requirement similarity. The membership values are defined for clustering process and it’s based on the users. It is used to reduce the search complexity as well as time complexity of the system.